Improved Algorithms for Rare Event Simulation with Heavy Tails
نویسنده
چکیده
The estimation of P(Sn > u) by simulation, where Sn is the sum of independent, identically distributed random varibles Y1, . . . , Yn, is of importance inmany applications. We propose two simulation estimators based upon the identity P(Sn > u) = nP(Sn > u, Mn = Yn), where Mn = max(Y1, . . . , Yn). One estimator uses importance sampling (for Yn only), and the other uses conditional Monte Carlo conditioning upon Y1, . . . , Yn−1. Properties of the relative error of the estimators are derived and a numerical study given in terms of the M/G/1 queue in which n is replaced by an independent geometric random variable N . The conclusion is that the new estimators compare extremely favorably with previous ones. In particular, the conditional Monte Carlo estimator is the first heavy-tailed example of an estimator with bounded relative error. Further improvements are obtained in the random-N case, by incorporating control variates and stratification techniques into the new estimation procedures.
منابع مشابه
E¢ cient Rare-event Simulation for the Maximum of Heavy-tailed Random Walks
Let (Xn : n 0) be a sequence of iid rvs with negative mean. Set S0 = 0 and de ne Sn = X1 + :::+Xn. We propose an importance sampling algorithm to estimate the tail of M = maxfSn : n 0g that is strongly e¢ cient for both light and heavy-tailed increment distributions. A key feature of our algorithm is that it is state-dependent. In the presence of light tails, our procedure leads to Siegmunds ...
متن کاملEfficient Rare-event Simulation for the Maximum of Heavy-tailed Random Walks
Let (Xn :n≥ 0) be a sequence of i.i.d. r.v.’s with negative mean. Set S0 = 0 and define Sn =X1 + · · ·+Xn. We propose an importance sampling algorithm to estimate the tail of M =max{Sn :n≥ 0} that is strongly efficient for both light and heavy-tailed increment distributions. Moreover, in the case of heavy-tailed increments and under additional technical assumptions, our estimator can be shown t...
متن کاملNew efficient estimators in rare event simulation with heavy tails
This paper is concerned with the efficient simulation of P (Sn > s) where Sn is the sum of n i.i.d. heavy-tailed random variables X1, . . . ,Xn. Asmussen and Kroese (2006) and Asmussen and Kortschak (2012) proposed estimators that combine exchangeability arguments with conditional Monte-Carlo and whose relative errors go to 0 as s→∞. We useMn = max (X1, . . . ,Xn) as a control variate to propos...
متن کاملMinimum Cross-entropy Methods for Rare-event Simulation
In this paper we apply the minimum cross-entropy method (MinxEnt) for estimating rare-event probabilities for the sum of i.i.d. random variables. MinxEnt is an analogy of the Maximum Entropy Principle in the sense that the objective is to minimize a relative (or cross) entropy of a target density h from an unknown density f under suitable constraints. The main idea is to use the solution to thi...
متن کاملA Hybrid Importance Sampling Algorithm for Estimating VaR under the Jump Diffusion Model
Value at Risk (VaR) is an important tool for estimating the risk of a financial portfolio under significant loss. Although Monte Carlo simulation is a powerful tool for estimating VaR, it is quite inefficient since the event of significant loss is usually rare. Previous studies suggest that the performance of the Monte Carlo simulation can be improved by importance sampling if the market return...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004